Precise Tiling for Uniform Loop Nests
نویسندگان
چکیده
منابع مشابه
Polygonal Iteration Space Partitioning using the Polyhedral Model
OF THE DISSERTATION Polygonal Iteration Space Partitioning using the Polyhedral Model By Aniket Shivam Master of Science in Computer Science University of California, Irvine, 2016 Professor Alexander V. Veidenbaum, Chair Loop-nests in most scientific applications perform repetitive operations on array(s) and account for most of the program execution time. Traditional loop transformations, such ...
متن کاملReducing Data Communication Overhead for Doacross Loop Nests Reducing Data Communication Overhead for Doacross Loop Nests
If the loop iterations of a loop nest cannot be partitioned into independent sets, the data communication for data dependences are inevitable in order to execute them on parallel machines. This kind of loop nests are referred to as Doacross loop nests. This paper is concerned with compiler algorithms for parallelizing Doacross loop nests for distributed-memory multicomputers. We present a metho...
متن کاملCache-Partitioned Tiling for Data Reuse Across Loop Nests
This paper presents cache-partitioned tiling, a systematic and integrated approach for global optimization of cache locality across multiple loop nests which reference multiple arrays. The approach is based on the idea of cache partitioning, in which the cache capacity is divided into a number of equal-sized sections. A data layout in memory is derived to eliminate cache connicts by ensuring th...
متن کاملAutomatic Tiling of “Mostly-Tileable” Loop Nests
Polyhedral compilation techniques have proven to be a powerful tool for optimization of dense array codes. In particular, their ability to tile imperfectly nested loops has provided dramatic speedups by countering limits of memory or network bandwidth. Unfortunately, certain codes, including RNA secondary-structure prediction codes, cannot be tiled effectively using the standard tiling algorith...
متن کامل(Pen)-ultimate tiling?
In the framework of perfect loop nests with uniform dependences, tiling is a technique used to group elemental computation points so as to increase computation granularity and to reduce the overhead due to communication time. We review existing approaches from the literature, together with the optimization criteria that are used for determining a \good" or \optimal" tiling. Then we explain the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995